Putting it all together – Formal verification of the VAMP

In the verified architecture microprocessor (VAMP) project we have designed, functionally verified, and synthesized a processor with full DLX instruction set, delayed branch, Tomasulo scheduler, maskable nested precise interrupts, pipelined fully IEEE compatible dual precision floating point unit with variable latency, and separate instruction and data caches. The verification has been carried out in the theorem proving system PVS. The processor has been implemented on a Xilinx FPGA. A shorter version of this article with the title “Instantiating uninterpreted functional units and memory system: functional verification of the VAMP” appeared in [8]. The work reported here was done while all the authors were with Saarland University.     

采样定理的内在不自洽性和工程应用的局限性——采样定理和奈奎斯特准则研究·上篇

推导证明了作为通信理论基石之一的采样定理及其公式存在着两个矛盾：内在不自洽性，即采样定理与其公式的推导前提条件相矛盾；采样定理在工程实际应用时的严重局限性     

浅谈解的存在唯一性定理在《偏微分方程数值解》中的应用

从一个新的角度讨论常微分方程中解的存在唯一性定理在偏微分方程数值解法中的重要应用。给出一类伪双曲型偏微分方程的新的分裂混合有限元数值格式,将该格式转化成常微分方程系统,利用解的存在唯一性定理证明该系统是存在唯一解的。通过简短的讨论、概述明确解的存在唯一定理在偏微分方程数值解中的应用方法．并希望能够在教学科研未来的发展中有新的观念。     

用计算机推理的方法求解数字填图问题

模拟人思考问题的过程．尝试用计算机推理的方法求解数字填图问题。     

利用PowerPoint的VBA编程功能制作勾股定理的探索与验证交互性课件

本文介绍了利用PowerPoint 2003的VBA编程功能制作“勾股定理的探索与验证”交互性课件方珐和程序代码。     

Fixed points of the RSA encryption algorithm

In this paper the problem of the number of fixed points for an RSA algorithm is considered. This is an important question from the point of view of any cryptosystem. We have estimated the expected value of this number for randomly chosen RSA parameters. It turned out that it is O(ln²n), and the probability of finding such a point is O(ln²n/n). Thus, these values are really negligible, which had been intuitively expected.